High Level Performance Estimate of Relational Queries

نویسنده

  • T. Wong
چکیده

Performance estimate of queries is a necessary part of any efficient database design methodology. In this paper, a high level performance estimator for relational queries is presented which is different from conventional evaluators such as SYSTEM R [Selinger 1979] in that performance is predicted without the details of the low level constructs such as links and indices. Rather, abstractions and reasonable assumptions of these low level constructs are used in a set of formulas to estimate the performance of a set of queries against a schema. The major results of the paper are (1) The realization and motivation of the need of high level performance estimators of this kind, and (2) a fast way to estimate the cost of N-way joins. The second result is interesting in that the algorithm for N-way joins is found to be similar to matrix multiplication optimization, with straight forward This work was supported by the Applied Mathematical Sciences Research Program of the Office of Energy Research U.S Department of Energy under contract W-7405-ENG-48.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Local and Global Query Optimization Mechanisms for Relational Databases

In a relational database management system (DBMS), query optimization is essential since the DBMS must produce candidate internal access strategies from a high level query and select the optimal one. The goals of inplementing a good optimization mechanism at-2: (a) to maximize the performance of selected access strategies and (b) to minimize the optimization overhead. We have developed an optim...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

Apply Uncertainty in Document-Oriented Database (MongoDB) Using F-XML

As moving to big data world where data is increasing in unstructured way with high velocity, there is a need of data-store to store this bundle amount of data. Traditionally, relational databases are used which are now not compatible to handle this large amount of data, so it is needed to move on to non-relational data-stores. In the current study, we have proposed an extension of the Mongo...

متن کامل

Relational Databases Query Optimization using Hybrid Evolutionary Algorithm

Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...

متن کامل

Providing Better Support for Quanti ed Queries

Relational database systems do not e ectively support complex queries containing quanti ers (quanti ed queries) that are increasingly becoming important in decision support applications. Generalized quanti ers provide an e ective way of expressing such queries naturally. In this paper, we consider the problem of processing quanti ed queries within the generalized quanti er framework. We demonst...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010